On the swapping algorithm

نویسندگان

  • Neal Madras
  • Zhongrong Zheng
چکیده

The Metropolis-coupled Markov chain method (or “Swapping Algorithm”) is an empirically successful hybrid Monte Carlo algorithm. It alternates between standard transitions on parallel versions of the system at different parameter values, and swapping two versions. We prove rapid mixing for two bimodal examples, including the mean-field Ising model. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 66–97, 2003

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

طبقه‌بندی زیرپیکسلی تصاویر ابرطیفی براساس تعمیم الگوریتم معاوضه پیکسلی و ارزیابی آن

The capability of the matter identification is developed considerably in hyperspectral images. The spectral reflectance of surfaces in these imaging systems in the visible and near infrared range of the electromagnetic spectrum is recorded in extremely narrow and continuous bands. But for some reasons, such as existence the mixed pixels and low spatial resolution of these images, is difficult t...

متن کامل

Bit Swapping Linear Feedback Shift Register For Low Power Application Using 130nm Complementary Metal Oxide Semiconductor Technology (TECHNICAL NOTE)

Bit swapping linear feedback shift register (BS-LFSR) is employed in a conventional linear feedback shirt register (LFSR) to reduce its power dissipation and enhance its performance. In this paper, an enhanced BS-LFSR for low power application is proposed. To achieve low power dissipation, the proposed BS-LFSR introduced the stacking technique to reduce leakage current. In addition, three diffe...

متن کامل

Thinning, Inserting, and Swapping Scattered Data

Thinning, insertion, and swapping algorithms for generating well-distributed hierarchical subsets of scattered data in a given domain in IR are proposed. It is found that thinning and insertion yield approximately similar results but that swapping is in general inferior.

متن کامل

A Spatio-Temporal Pixel-Swapping Algorithm for Subpixel Land Cover Mapping

The aim of this letter is to present a spatio–temporal pixel-swapping algorithm (STPSA), based on conventional pixelswapping algorithms (PSAs), in which both spatial and temporal contextual information from previous land cover maps or observed samples are well integrated and utilized to improve subpixel mapping accuracy. Unlike conventional pixel-swapping algorithms, STPSA is capable of utilizi...

متن کامل

A Mesh-Database-Independent Edge- and Face-Swapping Tool

Software re-use is an increasingly common practice in development of scientific computing software. Recently, there has been an emphasis on the definition of software components: software objects that use a clearly defined interface to encapsulate a specific functionality. In particular, at least two such component definitions have been developed for low-level mesh functionality and at least on...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2003